A Multilevel Algorithm for Force-Directed Graph Drawing
ثبت نشده
چکیده
منابع مشابه
Efficient, High-Quality Force-Directed Graph Drawing
We propose a graph drawing algorithm that is both efficient and high quality. This algorithm combines a multilevel approach, which effectively overcomes local minimums, with the Barnes and Hut [1] octree technique, which approximates shortand long-range force efficiently. Our numerical results show that the algorithm is comparable in speed to Walshaw’s [2] highly efficient multilevel graph draw...
متن کاملA Multilevel Algorithm for Force-Directed Graph-Drawing
We describe a heuristic method for drawing graphs which uses a multilevel framework combined with a force-directed placement algorithm. The multilevel technique matches and coalesces pairs of adjacent vertices to define a new graph and is repeated recursively to create a hierarchy of increasingly coarse graphs, G0, G1, . . . , GL. The coarsest graph, GL, is then given an initial layout and the ...
متن کاملDrawing Large Graphs with a Potential-Field-Based Multilevel Algorithm
Force-directed graph drawing algorithms are widely used for drawing general graphs. However, these methods do not guarantee a sub-quadratic running time in general. We present a new force-directed method that is based on a combination of an efficient multilevel scheme and a strategy for approximating the repulsive forces in the system by rapidly evaluating potential fields. Given a graph G = (V...
متن کاملA Distributed Multilevel Force-Directed Algorithm
The wide availability of powerful and inexpensive cloud computing services naturally motivates the study of distributed graph layout algorithms, able to scale to very large graphs. Nowadays, to process Big Data, companies are increasingly relying on PaaS infrastructures rather than buying and maintaining complex and expensive hardware. So far, only a few examples of basic force-directed algorit...
متن کاملDynamic Multilevel Graph Visualization
We adapt multilevel, force-directed graph layout techniques to visualizing dynamic graphs in which vertices and edges are added and removed in an online fashion (i.e., unpredictably). We maintain multiple levels of coarseness using a dynamic, randomized coarsening algorithm. To ensure the vertices follow smooth trajectories, we employ dynamics simulation techniques, treating the vertices as poi...
متن کامل